Перевод: со всех языков на все языки

со всех языков на все языки

heuristic scheduling

См. также в других словарях:

  • Scheduling (production processes) — Scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process. In manufacturing, the purpose of scheduling is to minimize the production time and costs, by telling a… …   Wikipedia

  • Hyper-heuristic — A hyper heuristic is a heuristic search method that seeks to automate, often by the incorporation of machine learning techniques, the process of selecting, combining, generating or adapting several simpler heuristics (or components of such… …   Wikipedia

  • Genetic algorithm scheduling — To be competitive, corporations must minimize inefficiencies and maximize productivity. In manufacturing, productivity is inherently linked to how well you can optimize the resources you have, reduce waste and increase efficiency. Finding the… …   Wikipedia

  • Instruction scheduling — In computer science, instruction scheduling is a compiler optimization used to improve instruction level parallelism, which improves performance on machines with instruction pipelines. Put more simply, without changing the meaning of the code, it …   Wikipedia

  • Modified due-date scheduling heuristic — The modified due date scheduling heuristic is used in scheduling tasks to resources (for example, to answer the question What order should we make sandwiches in, so as to please our customers? ). It assumes that the objective of the scheduling… …   Wikipedia

  • Modified due date scheduling heuristic — The modified due date heuristic is used in scheduling tasks to resources (e.g. to answer the question, what order should we make sandwiches in, so as to please our customers? ).It assumes that the objective of the scheduling process is to… …   Wikipedia

  • Job shop scheduling — For other uses, see Scheduling. Job shop scheduling (or Job shop problem) is an optimization problem in computer science in which ideal jobs are assigned to resources at particular times. The most basic version is as follows: We are given n jobs… …   Wikipedia

  • Shifting bottleneck heuristic — The Shifting Bottleneck Heuristic is a procedure intended to minimize the time it takes to do work, or specifically, the makespan in a job shop. The makespan is defined as the amount of time, from start to finish, to complete a set of multi… …   Wikipedia

  • Nurse scheduling problem — The Nurse scheduling problem (NSP) is the problem of determining a work schedule for nurses that is both reasonable (or fair) and efficient. Despite seeming trivial, this is a complex problem due to its many constraints and many possible… …   Wikipedia

  • HSTS — Heuristic Scheduling Testbed System ( > NASA NGST Acronym List ) …   Acronyms

  • HSTS — Heuristic Scheduling Testbed System ( > NASA NGST Acronym List ) …   Acronyms von A bis Z

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»